翻訳と辞書 |
Degree (graph theory) : ウィキペディア英語版 | Degree (graph theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.〔Diestel p.5〕 The degree of a vertex is denoted or . The maximum degree of a graph ''G'', denoted by Δ(''G''), and the minimum degree of a graph, denoted by δ(''G''), are the maximum and minimum degree of its vertices. In the graph on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, all degrees are the same, and so we can speak of ''the'' degree of the graph. ==Handshaking lemma== (詳細はhandshaking lemma. The latter name comes from a popular mathematical problem, to prove that in any group of people the number of people who have shaken hands with an odd number of other people from the group is even.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Degree (graph theory)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|